An Improved Worst - Case to Average - CaseConnection
نویسندگان
چکیده
We improve a connection of the worst-case complexity and the average-case complexity of some well-known lattice problems. This fascinating connection was rst discovered by Ajtai 1] in 1996. We improve the exponent of this connection from 8 to 3:5 + .
منابع مشابه
An Edge Labeling Approach to Concave Polygon Clipping
This paper describes an algorithm to perform clipping of two possibly concave polygons. The approach labels the edges of the input polygons. This labeling is used in classifying the resulting polygons in the sets A \ B, A n B and B n A. It is shown that its worst-case time complexity is not worse than the worst-case complexity of the problem of polygon clipping itself. Suggestions are made how ...
متن کاملAn improved heuristic for two-machine flowshop scheduling with an availability constraint
In this paper we study the two-machine owshop scheduling problem with an availability constraint on the rst machine. We rst show that the worst-case error bound 2 of the heuristic provided by Lee [4] is tight. We then develop an improved heuristic with a worst-case error bound of 3 . c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملAn Improved Algorithm for High-speed Floating-point Addition
This paper describes an improved, IEEE conforming oating-point addition algorithm. This algorithm has only one addition step involving the signi cand in the worst-case path, hence o ering a considerable speed advantage over the existing algorithms, which typically require two to three addition steps.
متن کاملNew Fixed-Priority Multiprocessor Scheduling Algorithms with Liu & Layland’s Utilization Bound
In a recent work [11], we have developed an algorithm generalizing the famous Liu and Layland’s utilization bound to multiprocessor scheduling. The algorithm has the best worst-case utilization bound compared with existing algorithms. However, its average-case performance is not satisfactory as the workload of each processor is limited by Liu and Layland’s bound. In this paper, we present a new...
متن کاملAll-Around Near-Optimal Solutions for the Online Bin Packing Problem
In this paper we present algorithms with optimal average-case and close-to-best known worst-case performance for the classic online bin packing problem. It has long been observed that known bin packing algorithms with optimal average-case performance are not optimal in the worst-case. In particular First Fit and Best Fit have optimal asymptotic average-case ratio of 1 but a worstcase competitiv...
متن کامل